Tightly-Secure Signatures from Five-Move Identification Protocols
نویسندگان
چکیده
We carry out a concrete security analysis of signature schemes obtained from five-move identification protocols via the Fiat-Shamir transform. Concretely, we obtain tightly-secure signatures based on the computational Diffie-Hellman (CDH), the short-exponent CDH, and the Factoring (FAC) assumptions. All our signature schemes have tight reductions to search problems, which is in stark contrast to all known signature schemes obtained from the classical Fiat-Shamir transform (based on three-move identification protocols), which either have a non-tight reduction to a search problem, or a tight reduction to a (potentially) stronger decisional problem. Surprisingly, our CDH-based scheme turns out to be (a slight simplification of) the Chevallier-Mames signature scheme (CRYPTO 05), thereby providing a theoretical explanation of its tight security proof via five-move identification protocols.
منابع مشابه
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
The Fiat-Shamir transform is a technique for combining a hash function and an identification scheme to produce a digital signature scheme. The resulting scheme is known to be secure in the random oracle model (ROM), which does not, however, imply security in the scenario where the adversary also has quantum access to the oracle. The goal of this current paper is to create a generic framework fo...
متن کاملThe Representation Problem Based on Factoring
We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption....
متن کاملA Comparison of Secure Routing Protocols in Ad Hoc Networks
An ad-hoc network is a self-configuring network of nodes (routers and hosts) connected by wireless links. The nodes are free to move randomly, organize themselves arbitrarily and the network's wireless topology may change rapidly and unpredictably. This freedom of routers and hosts to move in and out of the network creates security problems that are not seen in a wired network. This paper compa...
متن کاملA Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges between the signer and the user or are limited to issue only logarithmically many signatures in terms of a security parameter. This paper presents an efficient blind signature scheme that allows a polynomial number of signatures to...
متن کاملSurvey and New Idea for Attribute-Based Identification Scheme Secure against Reset Attacks
Identification schemes are a common one-way authentication technique for a user to prove himself securely to a verifier. However, it is known that identification schemes based on the sigma-protocol are basically insecure against reset attacks. On the otherhand, attribute-based cryptography is a technique which allows for the secure implementation of access policies within a cryptosystem. In thi...
متن کامل